Location:
Search - prim algorithm
Search list
Description: 分别利用prim算法和kruskal算法实现求图的最小生成树,感觉学习最小生成树的时候有挺多问题,这里是一个用PRIM和KRUSKAL算法做的一个最小生成树算法-, Respectively, using prim algorithm and Kruskal Algorithm for Minimum Spanning Tree, Minimum Spanning Tree feels when learning挺多have problems, here is an algorithm with PRIM and KRUSKAL make a minimum spanning tree algorithm
Platform: |
Size: 1024 |
Author: dialy |
Hits:
Description: 对任意给定的网络（顶点数和边数自定），建立它的邻接矩阵并输出，然后利用Prim算法或Kruskal算法生成它的最小生成树，并输出结果。-On any given network (the number of vertices and edges from the set), the establishment of its adjacency matrix and output, and then use Prim algorithm or Kruskal algorithm to generate its minimum spanning tree, and output results.
Platform: |
Size: 11264 |
Author: 陈冰晶 |
Hits:
Description: 关于图像分割的一个代码，最小生成树Prim算法，能够实现相应功能，拿出来与大家共享-Image Segmentation on a code, Prim minimum spanning tree algorithm, can achieve the corresponding functions, and show to share with you
Platform: |
Size: 1024 |
Author: 陈明敏 |
Hits:
Description: 求最小代价生成树（Prim算法和Kruskal算法）-Order to minimize the cost of spanning tree (Prim algorithm and Kruskal algorithm)
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 用matlab语言编写的最小生成树kruskal算法的通用源程序 。-Using matlab language Kruskal minimum spanning tree algorithm for general-purpose source.
Platform: |
Size: 3072 |
Author: 郝立颖 |
Hits:
Description: 利用图的存储、表示以及最短路径相关算法解决销售网络扩张问题。-Use maps of the store, as well as express the shortest path algorithm to solve the relevant sales network expansion.
Platform: |
Size: 54272 |
Author: 冯治 |
Hits:
Description: 程序首先给出边集数组中的元素类型、邻接矩阵类定义。其中，建立图的邻接矩阵CREATEMatrix函数的形参N为图的点数形参e为边数，rcw为结构体类型RCW的数组利用PRIM算法从定点V0出发求出用邻接矩阵GA表示的图的最小生成树，其边集存与数组CT中，PRIM算法对应的函数为PRIM。-First of all, given the procedures margination array element type, adjacency matrix class definition. Among them, the establishment of graph adjacency matrix CREATEMatrix function parameter N points for the map parameter e for the edge, rcw for the structure of the array type RCW use PRIM algorithm derived from the fixed point of departure V0 with adjacency matrix GA expressed Minimum Spanning Tree, and its margination CT in keeping with the array, PRIM algorithm corresponding function for the PRIM.
Platform: |
Size: 3072 |
Author: sjw87522 |
Hits:
Description: 求最小生成树，实现Prim算法
数据结构初学者可以参考-For minimum spanning tree, Prim algorithm realize beginners can refer to data structures
Platform: |
Size: 3026944 |
Author: orochi |
Hits:
Description: 晕个是最小生成树Prim算法，现在在建模，急用算法，希望能够能过站长的审核-Halo is Prim minimum spanning tree algorithm, is now in the modeling, emergency algorithm, hope to be able to head off the audit
Platform: |
Size: 1024 |
Author: f |
Hits:
Description: MALAB程序，包括顶点覆盖近似算法,哈密尔顿回路,画等温线,模拟退火应用,生成全排列矩阵,最小生成树Prim算法,最短路径等-MALAB procedures, including vertex cover approximation algorithm, Hamilton circuit, painting isotherms, simulated annealing applications, to generate full-rank matrix, Prim minimum spanning tree algorithm, the shortest path, etc.
Platform: |
Size: 45056 |
Author: john duan |
Hits:
Description: PKU中一些数据结构基本算法题的java实现，包括DIJ、PRIM、二叉查找树、并查集、动态规划、KMP、匈牙利算法、深搜广搜等-PKU some basic data structure algorithm java realization of the title, including DIJ, PRIM, binary search tree, and search sets, dynamic programming, KMP, the Hungarian algorithm, collected, such as deep-search
Platform: |
Size: 77824 |
Author: 俞昊旻 |
Hits:
Description: 最小生成树 采用C程序编程实现的PRIM算法-Minimum spanning tree using C programming algorithm to achieve the PRIM
Platform: |
Size: 1024 |
Author: Mary |
Hits:
Description: 二叉树中的prim最小生成树算法。编译环境：vistual stdio 2008-Binary tree in the minimum spanning tree algorithm prim. Compiler environment: vistual stdio 2008
Platform: |
Size: 24576 |
Author: guo |
Hits:
Description: 根据prim算法编写的求一棵树的最小生成树的程序。-Prepared in accordance with prim algorithm for a tree of minimum spanning tree procedure.
Platform: |
Size: 1024 |
Author: hezj |
Hits:
Description: 这是一个构造最小生成树的Prim算法，是属于贪心算法的范畴。设G=(V,E)是连同带权图，V={1，2，3，...，n}。构造G的最小生成树。-This is a structure of Prim minimum spanning tree algorithm is a greedy algorithm category. Set G = (V, E) is, together with the weighted graph, V = (1,2,3 ,..., n). G of the minimum spanning tree structure.
Platform: |
Size: 152576 |
Author: Katherine |
Hits:
Description: 题目1：图的建立与遍历；连通网的最小生成树生成实现。
内容：
1） 用邻接表表示方法建立图1所示图的存储结构，用邻接矩阵存表示方法建立图2所示网的存储结构。
2） 在图1 存储结构（邻接表）上实现深度优先搜索遍历和广度优先搜索遍历，并给出遍历结果（序列）。
3） 按照普里姆算法，在图2所示连通网的存储结构（邻接矩阵）上实现此网的最小生成树，并输出生成树。
-Title 1: Map of the establishment and ergodicity connectivity network to achieve minimum spanning tree generated. Content: 1) that the methods used to establish the adjacent table shown in Figure 1 Figure storage structure, said depositors with adjacency matrix method as shown in Figure 2 network storage structure. 2) In Figure 1 storage structure (adjacency list) to achieve depth-first search traversal and breadth-first search traversal, and gives Ergodic results (sequence). 3) in accordance with the prim algorithm, as shown in Figure 2-connected network storage structure (adjacency matrix) to achieve this network, minimum spanning tree and spanning tree output.
Platform: |
Size: 11264 |
Author: sad |
Hits:
Description: 给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价。-Given a region n the distance between cities network, using Prim algorithm or Kruskal minimum spanning tree algorithm, and calculate the cost of the minimum spanning tree.
Platform: |
Size: 971776 |
Author: 迟浩东 |
Hits:
Description: 本源码可供数据结构的初学者借鉴，叫最小生成树prim算法-The source for the data structure from the beginners, called minimum spanning tree algorithm prim
Platform: |
Size: 7168 |
Author: 郑海洋 |
Hits:
Description: 普里姆算法求最小生成树(邻接表存储)，用c++描写的，数据结构中的-Prim algorithm for minimum spanning tree (adjacent table storage), with c++ description, data structure
Platform: |
Size: 276480 |
Author: dingyi |
Hits:
Description: Prim algorithm to find shortest path in graph
Platform: |
Size: 2048 |
Author: saurabh |
Hits:
«
1
2
...
4
5
6
7
8
910
11
12
13
14
...
21
»